Fast Variable Selection by Block Addition and Block Deletion
نویسندگان
چکیده
منابع مشابه
Fast Variable Selection by Block Addition and Block Deletion
We propose the threshold updating method for terminating variable selection and two variable selection methods. In the threshold updating method, we update the threshold value when the approximation error smaller than the current threshold value is obtained. The first variable selection method is the combination of forward selection by block addition and backward selection by block deletion. In...
متن کاملIncremental Feature Selection by Block Addition and Block Deletion Using Least Squares SVRs
For a small sample problem with a large number of features, feature selection by cross-validation frequently goes into random tie breaking because of the discrete recognition rate. This leads to inferior feature selection results. To solve this problem, we propose using a least squares support vector regressor (LS SVR), instead of an LS support vector machine (LS SVM). We consider the labels (1...
متن کاملFast Sparse Matrix-Vector Multiplication by Exploiting Variable Block Structure
We improve the performance of sparse matrix-vector multiply (SpMV) on modern cache-based superscalar machines when the matrix structure consists of multiple, irregularly aligned rectangular blocks. Matrices from finite element modeling applications often have this kind of structure. Our technique splits the matrix, A, into a sum, A1 + A2 + . . . + As, where each term is stored in a new data str...
متن کاملA Block-Grouping Method for Image Denoising by Block Matching and 3-D Transform Filtering
Image denoising by block matching and threedimensionaltransform filtering (BM3D) is a two steps state-ofthe-art algorithm that uses the redundancy of similar blocks innoisy image for removing noise. Similar blocks which can havesome overlap are found by a block matching method and groupedto make 3-D blocks for 3-D transform filtering. In this paper wepropose a new block grouping algorithm in th...
متن کاملk-Block parallel addition versus 1-block parallel addition in non-standard numeration systems
Parallel addition in integer base is used for speeding up multiplication and division algorithms. k-block parallel addition has been introduced by Kornerup in [14]: instead of manipulating single digits, one works with blocks of fixed length k. The aim of this paper is to investigate how such notion influences the relationship between the base and the cardinality of the alphabet allowing block ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent Learning Systems and Applications
سال: 2010
ISSN: 2150-8402,2150-8410
DOI: 10.4236/jilsa.2010.24023